1 results listed
In this paper we introduce an algorithm for
constructing approximate Voronoi diagram of a set of pairwise
disjoint arcs on a plane. The arcs are represented by parametric
curves. On the first step, we discretize curves using the proposed
adaptive method. Then, we construct Voronoi diagram of the
discretized objects and process the obtained Voronoi graph such
that redundant edges and cells are removed. Finally, the edges of
the processed graph are approximated by Bezier curves giving the
parametric representation of the final Voronoi diagram. The total
complexity of the described algorithm is O(n log n) in average.
International Conference on Advanced Technologies, Computer Engineering and Science
ICATCES
Dmytro Kotsur
Vasyl Tereshchenko